University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
نویسندگان
چکیده
This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search algorithm. The approach presented in the paper has been successfully used for timetabling at the authors’ institution and it was capable of generating timetables for complex problem instances.
منابع مشابه
ارایه یک مدل ریاضی جدید جهت برنامه ریزی جدول زمان بندی دروس دانشگاهی بر اساس کیفیت ارایه دروس
One of the important tasks of universities that are usually challenging is university course timetabling problem. They are faced with this problem every year and every term and which is directly effective on education performance. In the university course timetabling problem, the university sources including lessons, lecturers, classes and other teaching sources are assigned to a series of time...
متن کاملGenetic Algorithms for University Course Timetabling Problems
The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...
متن کاملA Guided Search Genetic Algorithm for the University Course Timetabling Problem
The university course timetabling problem is a combinatorial optimisation problem in which a set of events has to be scheduled in time slots and located in suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper proposes a genetic algorithm with a guided search strategy and a local search technique for the u...
متن کاملApplication of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we no...
متن کاملUniversity Course Timetabling Using ACO: A Case Study on Laboratory Exercises
The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...
متن کامل